Bi-criteria optimization problems for decision rules
نویسندگان
چکیده
منابع مشابه
A decision support system for solving multiple criteria optimization problems
In this paper, multiple criteria optimization has been investigated. A new decision support system (DSS) has been developed for interactive solving of multiple criteria optimization problems (MOPs). The weighted-sum (WS) approach is implemented to solve the MOPs. The MOPs are solved by selecting different weight coefficient values for the criteria and solving single-criterion optimization probl...
متن کاملIntegrating partial optimization with scatter search for solving bi-criteria {0, 1}-knapsack problems
This paper deals with the problem of inaccuracy of the solutions generated by metaheuristic approaches for bi-criteria {0,1}-knapsack problems. A hybrid approach which combines systematic and heuristic search is proposed to reduce that inaccuracy in the context of a scatter search method. The components of the method are used to determine regions in the decision space to be systematically searc...
متن کاملQuantitative Comparison of Approximate Solution Sets for Bi-criteria Optimization Problems
We present the Integrated Preference Functional (IPF) for comparing the quality of proposed sets of near-pareto-optimal solutions to bi-criteria optimization problems. Evaluating the quality of such solution sets is one of the key issues in developing and comparing heuristics for multiple objective combinatorial optimization problems. The IPF is a set functional that, given a weight density fun...
متن کاملCore problems in bi-criteria {0, 1}-knapsack problems
The most efficient algorithms for solving the single-criterion {0, 1}-knapsack problem are based on the core concept (i.e., based on a small number of relevant variables). But this concept is not used in problems with more than one criterion. The main purpose of this paper is to validate the existence of such a set of variables in bi-criteria {0.1}-knapsack instances. Numerical experiments were...
متن کاملAn effective method based on the angular constraint to detect Pareto points in bi-criteria optimization problems
The most important issue in multi-objective optimization problems is to determine the Pareto points along the Pareto frontier. If the optimization problem involves multiple conflicting objectives, the results obtained from the Pareto-optimality will have the trade-off solutions that shaping the Pareto frontier. Each of these solutions lies at the boundary of the Pareto frontier, such that the i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2018
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-018-2905-0